Performance Analysis of Cache Resolution Policies for Data Discovery
نویسندگان
چکیده
Most of previous research in Mobile Ad Hoc Networks (MANETs) concentrated on the development and enhancement of neighbor discovery protocols and routing protocols, which could efficiently discover reliable route between two communication mobile nodes. Data caching addressed two basic issues: cache resolution and cache management. In this paper, we give a review of cache resolution scheme and performance analysis of these schemes using ns2. 32.
منابع مشابه
ارزیابی تطبیقی کارایی ساختار فراداده نظامهای شناسگر دیجیتالی
The main solution to the problems of persistency and uniqueness in identification of digital objects in a web environment is provided by using digital identifiers instead of URL. The main basis of this solution is resolution mechanism that is used in digital identifier systems. Resolution is the use of indirect names instead of URLs; what worked for the DNS (Domain Name System) in stabilizing i...
متن کاملCache Discovery Policies of MANET
In situations where establishing a network infrastructure is impossible, Ad-hoc networks are considered particularly important. Most of the previous research in Ad-hoc networks concentrated on the development and enhancement of dynamic routing protocols, which could efficiently discover routes between two communicating nodes. Although routing strategies is an important topic in MANETs, other to...
متن کاملPerformance comparison of four commercial GE discovery PET/CT scanners: A monte carlo study using GATE
Combined PET/CT scanners now play a major role in medicine for in vivo imaging in oncology, cardiology, neurology, and psychiatry. As the performance of a scanner depends not only on the scintillating material but also on the scanner design, with regards to the advent of newer scanners, there is a need to optimize acquisition protocols as well as to compare scanner ...
متن کاملA Cache Model for Modern Processors
Modern processors use high-performance cache replacement policies that outperform traditional alternatives like least-recently used (LRU). Unfortunately, current cache models use stack distances to predict LRU or its variants, and do not capture these high-performance policies. Accurate predictions of cache performance enable many optimizations in multicore systems. For example, cache partition...
متن کاملDynamic Page Mapping Policies for Cache Conflict Resolution on Standard Hardware
In computer systems with large, physically-indexed, direct-mapped caches, a poor mapping from virtual to physical pages causes excessive cache connict misses. In a previous paper we proposed a simple hardware device , the Cache Miss Lookaside (CML) Buuer, which identiies pages that are suuering from connict misses. The operating system can use this information to implement a dynamic page mappin...
متن کامل